Off-line vs. On-line Tuning: A Study on MAX–MIN Ant System for the TSP
نویسندگان
چکیده
Stochastic local search algorithms require finding an appropriate setting of their parameters in order to reach high performance. The parameter tuning approaches that have been proposed in the literature for this task can be classified into two families: on-line and off-line tuning. In this paper, we compare the results we achieved with these two approaches. In particular, we report the results of an experimental study based on a prominent ant colony optimization algorithm, MAX– MIN Ant System, for the traveling salesman problem. We observe the performance of on-line parameter tuning for different parameter adaptation schemes and for different numbers of parameters to be tuned. Our results indicate that, under the experimental conditions chosen here, offline tuned parameter settings are preferable.
منابع مشابه
Companion to Off-line vs. On-line tuning: MAX–MIN Ant System for the TSP
In the paper [1] we compare the results achieved with off-line and on-line tuning approaches. In particular, we report the results of an experimental study based onMAX–MIN Ant System (MMAS) for the traveling salesman problem (TSP). In this framework, we analyze the impact on the performance of online tuning of the number of parameters adapted. Moreover, thanks to a social experiment carried out...
متن کاملTuning MAX–MIN Ant System with off-line and on-line methods
In this paper, we study two approaches for tuning parameters of optimization algorithms: off-line and on-line tuning. The goal of tuning is to find an appropriate configuration of an algorithm, where a configuration is a specific setting of all parameters. In off-line tuning, the appropriate configuration is chosen after a preliminary phase. In on-line tuning, the configuration might be changed...
متن کاملCompanion to Off-line and On-line Tuning: A Study on Operator Selection for a Memetic Algorithm Applied to the QAP
In the paper [1] we study the performance of three memetic algorithms when their configuration is tuned either off-line or on-line. We assess the relative performance achieved by algorithms of different quality tuned either off-line or on-line. We tackle the quadratic assignment problem. The results suggest that off-line tuning achieves in general better performance than on-line tuning. On-line...
متن کاملTuning of Extended Kalman Filter using Self-adaptive Differential Evolution Algorithm for Sensorless Permanent Magnet Synchronous Motor Drive
In this paper, a novel method based on a combination of Extended Kalman Filter (EKF) with Self-adaptive Differential Evolution (SaDE) algorithm to estimate rotor position, speed and machine states for a Permanent Magnet Synchronous Motor (PMSM) is proposed. In the proposed method, as a first step SaDE algorithm is used to tune the noise covariance matrices of state noise and measurement noise i...
متن کاملMMAS Algorithm using Fuzzy Rules
The real life problems deal with imperfectly specified knowledge and some degree of imprecision, uncertainty or inconsistency is embedded in the problem specification. The well-founded theory of fuzzy sets is a special way to model the uncertainty. The rules in a fuzzy model contain a set of propositions, each of which restricts a fuzzy variable to a single fuzzy value by means of the predicate...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010